import math
n = int(input())
target = math.ceil(n / 2)
arr = [int(k) for k in input().split()]
neg, pos = 0, 0
for el in arr:
if el > 0:
pos += 1
elif el < 0:
neg += 1
if pos >= target:
print(1)
elif neg >= target:
print(-1)
else:
print(0)#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
while(cin>>n)//cin>>n;
{
int num[n],count[3]={0};
for(int i=0;i<n;++i)
{
cin>>num[i];
if( num[i] < 0 )//count -1 0 1
count[0]++;
else if( num[i] == 0 )
count[1]++;
else
count[2]++;
}
// cout<<count[0]<<" "<<count[1]<<" "<<count[2]<<endl;
if( count[0] == count[2] && count[1] )
cout<< 0 << endl;
else if( (count[0] >= count[1] && count[0] >= count[2]) && (count[0] >= count[1]+count[2] ) )
cout<< -1 << endl;
else if( (count[2] >= count[1] && count[2] > count[0] ) && (count[2] >= count[1]+count[0]) )
cout<< 1 << endl;
else
cout<< 0 << endl;
}
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |